The Lollipop Graph is Determined by its Spectrum

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Lollipop Graph is Determined by its Spectrum

An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a path with pendant vertex as distinguished vertex. It is known that the odd lollipop is determined by its spectrum and the question is asked by W. Haemers, X. Liu and Y. Zhang for the even lollipop. We revisit the proof for odd lollipop, generalize it for even lollipop and therefore answer the question. O...

متن کامل

Erratum to "The lollipop graph is determined by its Q-spectrum"

A graph G is said to be determined by its Q-spectrum if with respect to the signless Laplacian matrix Q , any graph having the same spectrum as G is isomorphic to G. The lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex of a path Pn−p. In this paper, it is proved that all lollipop graphs are determined by their Q -spectra. © 2008 Elsevier B.V. All rights r...

متن کامل

Characterizations of the simple group $D_{n}(3)$ by prime graph and spectrum

We prove that $D_n(3)$, where $ngeq6$ is even, is uniquely determined by its prime graph. Also, if $G$ is a finite group with the same prime graph as $D_4(3)$, then $Gcong D_4(3), B_3(3), C_3(3)$ or $G/O_2(G)cong {rm Aut}({}^2B_2(8))$.

متن کامل

When Is a Distribution Determined by Its Letter Values ?

Suppose that the differences between the successive letter values of a continuous symmetric distribution form a geometric progression. Under very simple regularity assumptions it is shown that the distribution is uniquely determined. As an application, a statistic based only on the letter values is constructed for testing the hypothesis that a data set is drawn from any given, completely specif...

متن کامل

Some Graph Polynomials of the Power Graph and its Supergraphs

‎In this paper‎, ‎exact formulas for the dependence‎, ‎independence‎, ‎vertex cover and clique polynomials of the power graph and its‎ ‎supergraphs for certain finite groups are presented‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2008

ISSN: 1077-8926

DOI: 10.37236/798